On r-regular r-connected non-hamiltonian graphs
نویسندگان
چکیده
منابع مشابه
Deficiencies of r-regular k-edge-connected graphs
Let G be a simple graph having a maximum matching M. The deficiency def(G) of G is the number of M-unsaturated vertices in G. A problem that arises is that of determining the set of possible values of def(G). In this paper we present a solution for the case of r-regular k-edge-connected graphs. 1. INTRODUCTION In this paper the graphs are finite, loopless and have no multiple edges. For the mos...
متن کاملGenerating r-regular graphs
For each nonnegative integer r we determine a set of graph operations such that all r regular loopless graphs can be generated from the smallest r regular loopless graphs by using these operations We also discuss possible extensions of this result to r regular graphs of girth at least g for each xed g
متن کاملOn r-Connected Graphs with No Semi-topological r-Wheel
A semi-topological r-wheel, denoted by Sr, is a subdivision of the r-wheel preserving the spokes; the paper describes the r-connected graphs having no Sr-subgraphs. For r > 3, these are shown to be only Kr,r, while the class H of 3-connected S3-free graphs is unexpectedly rich. First, every graph G in H has an efficiently recognizable set of “contractible edges” (sometimes empty) such that a co...
متن کاملOn Hamiltonian Regular Graphs
In this paper we shall determine, when 1 = 6, bounds for numbers f(k, I) and F{k, 1) defined as follows: f{k, l)/F(k, I) is defined to be the smallest integer n for which there exists a regular graph/Hamiltonian regular graph of valency k and girth I having n vertices. The problem of determining minimal regular graphs of given girth was first considered by Tutte [9]. Bounds for f(k, I) have bee...
متن کاملUnmixed $r$-partite graphs
Unmixed bipartite graphs have been characterized by Ravindra and Villarreal independently. Our aim in this paper is to characterize unmixed $r$-partite graphs under a certain condition, which is a generalization of Villarreal's theorem on bipartite graphs. Also, we give some examples and counterexamples in relevance to this subject.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1981
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700007589